Relevant Cycle Hypergraph Representation for Molecules
نویسندگان
چکیده
Chemoinformatics aims to predict molecule’s properties through informational methods. Some methods base their prediction model on the comparison of molecular graphs. Considering such a molecular representation, graph kernels provide a nice framework which allows to combine machine learning techniques with graph theory. Despite the fact that molecular graph encodes all structural information of a molecule, it does not explicitly encode cyclic information. In this paper, we propose a new molecular representation based on a hypergraph which explicitly encodes both cyclic and acyclic information into one molecular representation called relevant cycle hypergraph. In addition, we propose a similarity measure in order to compare relevant cycle hypergraphs and use this molecular representation in a chemoinformatics prediction problem.
منابع مشابه
ON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS
A t-Cayley hypergraph X = t-Cay(G; S) is called normal for a finite group G, if the right regular representationR(G) of G is normal in the full automorphism group Aut(X) of X. In this paper, we investigate the normality of t-Cayley hypergraphs of abelian groups, where S < 4.
متن کاملTOP HOMOLOGY OF HYPERGRAPH MATCHING COMPLEXES, p-CYCLE COMPLEXES AND QUILLEN COMPLEXES OF SYMMETRIC GROUPS
We investigate the representation of a symmetric group Sn on the homology of its Quillen complex at a prime p. For homology groups in small codimension, we derive an explicit formula for this representation in terms of the representations of symmetric groups on homology groups of p-uniform hypergraph matching complexes. We conjecture an explicit formula for the representation of Sn on the top h...
متن کاملEigenvalues and Quasirandom Hypergraphs
Let p(k) denote the partition function of k. For each k ≥ 2, we describe a list of p(k) − 1 quasirandom properties that a k-uniform hypergraph can have. Our work connects previous notions on hypergraph quasirandomness, beginning with the early work of Chung and Graham and Frankl-Rödl related to strong hypergraph regularity, the spectral approach of Friedman-Wigderson, and more recent results of...
متن کاملOn tight cycles in hypergraphs
A tight k-uniform `-cycle, denoted by TC ` , is a k-uniform hypergraph whose vertex set is v0, · · · , v`−1, and the edges are all the k-tuples {vi, vi+1, · · · , vi+k−1}, with subscripts modulo k. Motivated by a classic result in graph theory that every n-vertex cycle-free graph has at most n− 1 edges, Sós and, independently, Verstraëte asked whether for every integer k, a k-uniform n-vertex h...
متن کاملRegression-based Hypergraph Learning for Image Clustering and Classification
Inspired by the recently remarkable successes of Sparse Representation (SR), Collaborative Representation (CR) and sparse graph, we present a novel hypergraph model named Regression-based Hypergraph (RH) which utilizes the regression models to construct the high quality hypergraphs. Moreover, we plug RH into two conventional hypergraph learning frameworks, namely hypergraph spectral clustering ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013